An iterated greedy algorithm for total flow time minimization in unrelated parallel batch machines with unequal job release times
نویسندگان
چکیده
منابع مشابه
An Iterated Greedy Algorithm for Flexible Flow Lines with Sequence Dependent Setup Times to Minimize Total Weighted Completion Time
This paper explores the flexile flow lines where setup times are sequence- dependent. The optimization criterion is the minimization of total weighted completion time. We propose an iterated greedy algorithm (IGA) to tackle the problem. An experimental evaluation is conducted to evaluate the proposed algorithm and, then, the obtained results of IGA are compared against those of some other exist...
متن کاملAn Iterated Greedy Algorithm for Solving the Blocking Flow Shop Scheduling Problem with Total Flow Time Criteria
In this paper, we propose an iterated greedy algorithm for solving the blocking flow shop scheduling problem with total flow time minimization objective. The steps of this algorithm are designed very efficient. For generating an initial solution, we develop an efficient constructive heuristic by modifying the best known NEH algorithm. Effectiveness of the proposed iterated greedy algorithm is t...
متن کاملan iterated greedy algorithm for flexible flow lines with sequence dependent setup times to minimize total weighted completion time
this paper explores the flexile flow lines where setup times are sequence- dependent. the optimization criterion is the minimization of total weighted completion time. we propose an iterated greedy algorithm (iga) to tackle the problem. an experimental evaluation is conducted to evaluate the proposed algorithm and, then, the obtained results of iga are compared against those of some other exist...
متن کاملMakespan Minimization on Parallel Batch Processing Machines with Release Times and Job Sizes
This paper investigates the scheduling problem of minimizing makespan on parallel batch processing machines encountered in different manufacturing environments, such as the burn-in operation in the manufacture of semiconductors and the aging test operation in the manufacture of thin film transistor-liquid crystal displays (TFT-LCDs). Each job is characterized by a processing time, a release tim...
متن کاملan iterated greedy algorithm for solving the blocking flow shop scheduling problem with total flow time criteria
in this paper, we propose an iterated greedy algorithm for solving the blocking flow shop scheduling problem with total flow time minimization objective. the steps of this algorithm are designed very efficient. for generating an initial solution, we develop an efficient constructive heuristic by modifying the best known neh algorithm. effectiveness of the proposed iterated greedy algorithm is t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Engineering Applications of Artificial Intelligence
سال: 2019
ISSN: 0952-1976
DOI: 10.1016/j.engappai.2018.10.012